TSTP Solution File: SYN364^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN364^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 11:57:04 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SYN364^5 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.36 % Computer : n013.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 17:26:23 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.36 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.JA7YL8BBC8/Vampire---4.8_3652
% 0.16/0.38 % (3814)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.16/0.38 % (3815)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.16/0.38 % (3813)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.16/0.38 % (3817)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.16/0.38 % (3818)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.16/0.38 % (3816)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.16/0.38 % (3820)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.16/0.38 % (3817)Instruction limit reached!
% 0.16/0.38 % (3817)------------------------------
% 0.16/0.38 % (3817)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (3817)Termination reason: Unknown
% 0.16/0.38 % (3817)Termination phase: Property scanning
% 0.16/0.38
% 0.16/0.38 % (3817)Memory used [KB]: 895
% 0.16/0.38 % (3817)Time elapsed: 0.003 s
% 0.16/0.38 % (3817)Instructions burned: 2 (million)
% 0.16/0.38 % (3817)------------------------------
% 0.16/0.38 % (3817)------------------------------
% 0.16/0.38 % (3816)Instruction limit reached!
% 0.16/0.38 % (3816)------------------------------
% 0.16/0.38 % (3816)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (3816)Termination reason: Unknown
% 0.16/0.38 % (3816)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (3816)Memory used [KB]: 5500
% 0.16/0.38 % (3816)Time elapsed: 0.003 s
% 0.16/0.38 % (3816)Instructions burned: 2 (million)
% 0.16/0.38 % (3816)------------------------------
% 0.16/0.38 % (3816)------------------------------
% 0.16/0.38 % (3820)Instruction limit reached!
% 0.16/0.38 % (3820)------------------------------
% 0.16/0.38 % (3820)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (3820)Termination reason: Unknown
% 0.16/0.38 % (3820)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (3820)Memory used [KB]: 5500
% 0.16/0.38 % (3820)Time elapsed: 0.004 s
% 0.16/0.38 % (3820)Instructions burned: 3 (million)
% 0.16/0.38 % (3820)------------------------------
% 0.16/0.38 % (3820)------------------------------
% 0.16/0.38 % (3818)First to succeed.
% 0.16/0.38 % (3814)Instruction limit reached!
% 0.16/0.38 % (3814)------------------------------
% 0.16/0.38 % (3814)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.38 % (3814)Termination reason: Unknown
% 0.16/0.38 % (3814)Termination phase: Saturation
% 0.16/0.38
% 0.16/0.38 % (3814)Memory used [KB]: 5500
% 0.16/0.38 % (3814)Time elapsed: 0.006 s
% 0.16/0.38 % (3814)Instructions burned: 4 (million)
% 0.16/0.38 % (3814)------------------------------
% 0.16/0.38 % (3814)------------------------------
% 0.16/0.39 % (3813)Also succeeded, but the first one will report.
% 0.16/0.39 % (3818)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for Vampire---4
% 0.16/0.39 % SZS output start Proof for Vampire---4
% 0.16/0.39 thf(func_def_0, type, cP: $i > $i > $o).
% 0.16/0.39 thf(func_def_1, type, g: $i > $i).
% 0.16/0.39 thf(func_def_2, type, cM: $i > $o).
% 0.16/0.39 thf(func_def_3, type, cQ: $i > $o).
% 0.16/0.39 thf(func_def_4, type, f: $i > $i > $i).
% 0.16/0.39 thf(func_def_8, type, sK0: $i > $i).
% 0.16/0.39 thf(f49,plain,(
% 0.16/0.39 $false),
% 0.16/0.39 inference(avatar_sat_refutation,[],[f24,f32,f40,f43,f48])).
% 0.16/0.39 thf(f48,plain,(
% 0.16/0.39 ~spl2_1 | ~spl2_4),
% 0.16/0.39 inference(avatar_contradiction_clause,[],[f47])).
% 0.16/0.39 thf(f47,plain,(
% 0.16/0.39 $false | (~spl2_1 | ~spl2_4)),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f45])).
% 0.16/0.39 thf(f45,plain,(
% 0.16/0.39 ($true != $true) | (~spl2_1 | ~spl2_4)),
% 0.16/0.39 inference(superposition,[],[f31,f20])).
% 0.16/0.39 thf(f20,plain,(
% 0.16/0.39 ( ! [X4 : $i] : (((cP @ X4 @ X4) = $true)) ) | ~spl2_1),
% 0.16/0.39 inference(avatar_component_clause,[],[f19])).
% 0.16/0.39 thf(f19,plain,(
% 0.16/0.39 spl2_1 <=> ! [X4] : ((cP @ X4 @ X4) = $true)),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.16/0.39 thf(f31,plain,(
% 0.16/0.39 ( ! [X7 : $i] : (((cP @ (g @ sK1) @ X7) != $true)) ) | ~spl2_4),
% 0.16/0.39 inference(avatar_component_clause,[],[f30])).
% 0.16/0.39 thf(f30,plain,(
% 0.16/0.39 spl2_4 <=> ! [X7] : ((cP @ (g @ sK1) @ X7) != $true)),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_4])])).
% 0.16/0.39 thf(f43,plain,(
% 0.16/0.39 ~spl2_1 | spl2_3),
% 0.16/0.39 inference(avatar_contradiction_clause,[],[f42])).
% 0.16/0.39 thf(f42,plain,(
% 0.16/0.39 $false | (~spl2_1 | spl2_3)),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f41])).
% 0.16/0.39 thf(f41,plain,(
% 0.16/0.39 ($true != $true) | (~spl2_1 | spl2_3)),
% 0.16/0.39 inference(superposition,[],[f28,f20])).
% 0.16/0.39 thf(f28,plain,(
% 0.16/0.39 ((cP @ sK1 @ sK1) != $true) | spl2_3),
% 0.16/0.39 inference(avatar_component_clause,[],[f26])).
% 0.16/0.39 thf(f26,plain,(
% 0.16/0.39 spl2_3 <=> ((cP @ sK1 @ sK1) = $true)),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_3])])).
% 0.16/0.39 thf(f40,plain,(
% 0.16/0.39 ~spl2_2),
% 0.16/0.39 inference(avatar_contradiction_clause,[],[f39])).
% 0.16/0.39 thf(f39,plain,(
% 0.16/0.39 $false | ~spl2_2),
% 0.16/0.39 inference(subsumption_resolution,[],[f38,f23])).
% 0.16/0.39 thf(f23,plain,(
% 0.16/0.39 ( ! [X3 : $i,X5 : $i] : (($true != (cP @ X3 @ X5))) ) | ~spl2_2),
% 0.16/0.39 inference(avatar_component_clause,[],[f22])).
% 0.16/0.39 thf(f22,plain,(
% 0.16/0.39 spl2_2 <=> ! [X5,X3] : ($true != (cP @ X3 @ X5))),
% 0.16/0.39 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.16/0.39 thf(f38,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((cP @ X0 @ (sK0 @ X0)) = $true)) ) | ~spl2_2),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f37])).
% 0.16/0.39 thf(f37,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((cP @ X0 @ (sK0 @ X0)) = $true) | ($true != $true)) ) | ~spl2_2),
% 0.16/0.39 inference(superposition,[],[f36,f17])).
% 0.16/0.39 thf(f17,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((cQ @ (f @ X0 @ (sK0 @ X0))) = $true) | ((cP @ X0 @ (sK0 @ X0)) = $true)) )),
% 0.16/0.39 inference(cnf_transformation,[],[f12])).
% 0.16/0.39 thf(f12,plain,(
% 0.16/0.39 ! [X0] : ((((cQ @ (f @ X0 @ (sK0 @ X0))) = $true) & ($true = (cM @ X0))) | ((cP @ X0 @ (sK0 @ X0)) = $true)) & ! [X2] : (($true != (cQ @ X2)) | ($true != (cM @ (g @ X2)))) & ! [X3] : (! [X4] : ((cP @ X4 @ X4) = $true) | ! [X5] : ($true != (cP @ X3 @ X5))) & ! [X7] : (((cP @ sK1 @ sK1) != $true) | ((cP @ (g @ sK1) @ X7) != $true))),
% 0.16/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11,f10])).
% 0.16/0.39 thf(f10,plain,(
% 0.16/0.39 ! [X0] : (? [X1] : ((($true = (cQ @ (f @ X0 @ X1))) & ($true = (cM @ X0))) | ((cP @ X0 @ X1) = $true)) => ((((cQ @ (f @ X0 @ (sK0 @ X0))) = $true) & ($true = (cM @ X0))) | ((cP @ X0 @ (sK0 @ X0)) = $true)))),
% 0.16/0.39 introduced(choice_axiom,[])).
% 0.16/0.39 thf(f11,plain,(
% 0.16/0.39 ? [X6] : ! [X7] : (((cP @ X6 @ X6) != $true) | ((cP @ (g @ X6) @ X7) != $true)) => ! [X7] : (((cP @ sK1 @ sK1) != $true) | ((cP @ (g @ sK1) @ X7) != $true))),
% 0.16/0.39 introduced(choice_axiom,[])).
% 0.16/0.39 thf(f9,plain,(
% 0.16/0.39 ! [X0] : ? [X1] : ((($true = (cQ @ (f @ X0 @ X1))) & ($true = (cM @ X0))) | ((cP @ X0 @ X1) = $true)) & ! [X2] : (($true != (cQ @ X2)) | ($true != (cM @ (g @ X2)))) & ! [X3] : (! [X4] : ((cP @ X4 @ X4) = $true) | ! [X5] : ($true != (cP @ X3 @ X5))) & ? [X6] : ! [X7] : (((cP @ X6 @ X6) != $true) | ((cP @ (g @ X6) @ X7) != $true))),
% 0.16/0.39 inference(rectify,[],[f8])).
% 0.16/0.39 thf(f8,plain,(
% 0.16/0.39 ! [X1] : ? [X2] : ((((cQ @ (f @ X1 @ X2)) = $true) & ($true = (cM @ X1))) | ((cP @ X1 @ X2) = $true)) & ! [X0] : (((cQ @ X0) != $true) | ((cM @ (g @ X0)) != $true)) & ! [X3] : (! [X5] : ((cP @ X5 @ X5) = $true) | ! [X4] : ((cP @ X3 @ X4) != $true)) & ? [X6] : ! [X7] : (((cP @ X6 @ X6) != $true) | ((cP @ (g @ X6) @ X7) != $true))),
% 0.16/0.39 inference(flattening,[],[f7])).
% 0.16/0.39 thf(f7,plain,(
% 0.16/0.39 ? [X6] : ! [X7] : (((cP @ X6 @ X6) != $true) | ((cP @ (g @ X6) @ X7) != $true)) & (! [X1] : ? [X2] : ((((cQ @ (f @ X1 @ X2)) = $true) & ($true = (cM @ X1))) | ((cP @ X1 @ X2) = $true)) & ! [X3] : (! [X5] : ((cP @ X5 @ X5) = $true) | ! [X4] : ((cP @ X3 @ X4) != $true)) & ! [X0] : (((cQ @ X0) != $true) | ((cM @ (g @ X0)) != $true)))),
% 0.16/0.39 inference(ennf_transformation,[],[f6])).
% 0.16/0.39 thf(f6,plain,(
% 0.16/0.39 ~((! [X1] : ? [X2] : ((((cQ @ (f @ X1 @ X2)) = $true) & ($true = (cM @ X1))) | ((cP @ X1 @ X2) = $true)) & ! [X3] : (? [X4] : ((cP @ X3 @ X4) = $true) => ! [X5] : ((cP @ X5 @ X5) = $true)) & ! [X0] : (((cQ @ X0) = $true) => ((cM @ (g @ X0)) != $true))) => ! [X6] : ? [X7] : (((cP @ X6 @ X6) = $true) & ((cP @ (g @ X6) @ X7) = $true)))),
% 0.16/0.39 inference(flattening,[],[f5])).
% 0.16/0.39 thf(f5,plain,(
% 0.16/0.39 ~((! [X0] : (((cQ @ X0) = $true) => ~((cM @ (g @ X0)) = $true)) & ! [X1] : ? [X2] : ((((cQ @ (f @ X1 @ X2)) = $true) & ($true = (cM @ X1))) | ((cP @ X1 @ X2) = $true)) & ! [X3] : (? [X4] : ((cP @ X3 @ X4) = $true) => ! [X5] : ((cP @ X5 @ X5) = $true))) => ! [X6] : ? [X7] : (((cP @ X6 @ X6) = $true) & ((cP @ (g @ X6) @ X7) = $true)))),
% 0.16/0.39 inference(fool_elimination,[],[f4])).
% 0.16/0.39 thf(f4,plain,(
% 0.16/0.39 ~((! [X0] : ((cQ @ X0) => ~(cM @ (g @ X0))) & ! [X1] : ? [X2] : (((cM @ X1) & (cQ @ (f @ X1 @ X2))) | (cP @ X1 @ X2)) & ! [X3] : (? [X4] : (cP @ X3 @ X4) => ! [X5] : (cP @ X5 @ X5))) => ! [X6] : ? [X7] : ((cP @ X6 @ X6) & (cP @ (g @ X6) @ X7)))),
% 0.16/0.39 inference(rectify,[],[f2])).
% 0.16/0.39 thf(f2,negated_conjecture,(
% 0.16/0.39 ~((! [X5] : ((cQ @ X5) => ~(cM @ (g @ X5))) & ! [X3] : ? [X4] : (((cM @ X3) & (cQ @ (f @ X3 @ X4))) | (cP @ X3 @ X4)) & ! [X0] : (? [X1] : (cP @ X0 @ X1) => ! [X2] : (cP @ X2 @ X2))) => ! [X3] : ? [X4] : ((cP @ X3 @ X3) & (cP @ (g @ X3) @ X4)))),
% 0.16/0.39 inference(negated_conjecture,[],[f1])).
% 0.16/0.39 thf(f1,conjecture,(
% 0.16/0.39 (! [X5] : ((cQ @ X5) => ~(cM @ (g @ X5))) & ! [X3] : ? [X4] : (((cM @ X3) & (cQ @ (f @ X3 @ X4))) | (cP @ X3 @ X4)) & ! [X0] : (? [X1] : (cP @ X0 @ X1) => ! [X2] : (cP @ X2 @ X2))) => ! [X3] : ? [X4] : ((cP @ X3 @ X3) & (cP @ (g @ X3) @ X4))),
% 0.16/0.39 file('/export/starexec/sandbox2/tmp/tmp.JA7YL8BBC8/Vampire---4.8_3652',cX2115)).
% 0.16/0.39 thf(f36,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((cQ @ X0) != $true)) ) | ~spl2_2),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f35])).
% 0.16/0.39 thf(f35,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((cQ @ X0) != $true) | ($true != $true)) ) | ~spl2_2),
% 0.16/0.39 inference(superposition,[],[f15,f34])).
% 0.16/0.39 thf(f34,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (($true = (cM @ X0))) ) | ~spl2_2),
% 0.16/0.39 inference(trivial_inequality_removal,[],[f33])).
% 0.16/0.39 thf(f33,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (($true != $true) | ($true = (cM @ X0))) ) | ~spl2_2),
% 0.16/0.39 inference(superposition,[],[f23,f16])).
% 0.16/0.39 thf(f16,plain,(
% 0.16/0.39 ( ! [X0 : $i] : (((cP @ X0 @ (sK0 @ X0)) = $true) | ($true = (cM @ X0))) )),
% 0.16/0.39 inference(cnf_transformation,[],[f12])).
% 0.16/0.39 thf(f15,plain,(
% 0.16/0.39 ( ! [X2 : $i] : (($true != (cM @ (g @ X2))) | ($true != (cQ @ X2))) )),
% 0.16/0.39 inference(cnf_transformation,[],[f12])).
% 0.16/0.39 thf(f32,plain,(
% 0.16/0.39 ~spl2_3 | spl2_4),
% 0.16/0.39 inference(avatar_split_clause,[],[f13,f30,f26])).
% 0.16/0.39 thf(f13,plain,(
% 0.16/0.39 ( ! [X7 : $i] : (((cP @ sK1 @ sK1) != $true) | ((cP @ (g @ sK1) @ X7) != $true)) )),
% 0.16/0.39 inference(cnf_transformation,[],[f12])).
% 0.16/0.39 thf(f24,plain,(
% 0.16/0.39 spl2_1 | spl2_2),
% 0.16/0.39 inference(avatar_split_clause,[],[f14,f22,f19])).
% 0.16/0.39 thf(f14,plain,(
% 0.16/0.39 ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (cP @ X3 @ X5)) | ((cP @ X4 @ X4) = $true)) )),
% 0.16/0.39 inference(cnf_transformation,[],[f12])).
% 0.16/0.39 % SZS output end Proof for Vampire---4
% 0.16/0.39 % (3818)------------------------------
% 0.16/0.39 % (3818)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.39 % (3818)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (3818)Memory used [KB]: 5500
% 0.16/0.39 % (3818)Time elapsed: 0.007 s
% 0.16/0.39 % (3818)Instructions burned: 3 (million)
% 0.16/0.39 % (3818)------------------------------
% 0.16/0.39 % (3818)------------------------------
% 0.16/0.39 % (3812)Success in time 0.019 s
% 0.16/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------